Automatically Verifying Concurrent Queue Algorithms
نویسندگان
چکیده
منابع مشابه
Automatically Verifying Concurrent Queue Algorithms
Concurrent FIFO queues are a common component of concurrent systems. Using a single shared lock to prevent concurrent manipulations of queue contents reduces system concurrency. Therefore, many algorithms were suggested to increase concurrency while maintaining the correctness of queue manipulations. This paper shows how to automatically verify partial correctness of concurrent FIFO queue algor...
متن کاملVerifying Concurrent Graph Algorithms
We show how to verify four challenging concurrent ne-grained graph-manipulating algorithms, including graph copy, a speculativelyparallel Dijkstra and spanning tree. We develop a method of reasoning for such algorithms that dynamically tracks the contributions and responsibilities of each thread operating on a graph, even in cases of arbitrary recursive thread creation. We demonstrate how to us...
متن کاملThesis Proposal Verifying Concurrent Randomized Algorithms
Concurrency and randomization are two programming features that are notoriously difficult to use correctly. This is because programs that use them no longer behave deterministically, so programmers must take into account the set of all possible interactions and random choices that may occur. A common approach to reasoning about complex programs is to use relational or refinement reasoning: to u...
متن کاملVerifying timing properties of concurrent algorithms
This paper presents a method for computer-aided veri cation of timing properties of real-time systems. A timed automaton model, along with invariant assertion and simulation techniques for proving properties of real-time systems, is formalized within the Larch Shared Language. This framework is then used to prove time bounds for two sample algorithms|a simple counter and Fischer's mutual exclus...
متن کاملVerifying Concurrent Memory Reclamation Algorithms with Grace
Memory management is one of the most complex aspects of modern concurrent algorithms, and various techniques proposed for it—such as hazard pointers, read-copy-update and epoch-based reclamation—have proved very challenging for formal reasoning. In this paper, we show that different memory reclamation techniques actually rely on the same implicit synchronisation pattern, not clearly reflected i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80006-4